A Linearly Constrained Least-squares Problem in Electronic Structure Computations
نویسندگان
چکیده
Abstract. One of the fundamental problems in electronic structure calculations is to determine the electron density associated with the minimum total energy of a molecular or bulk system. The total energy minimization problem is often formulated as a nonlinear eigenvalue problem. The most widely used algorithm for solving this type of problem is the self-consistent field (SCF) iteration accelerated by Anderson acceleration (SCF-AA), in which a linearly constrained least-squares problem is embedded. We will examine and compare the numerical stability of three different ways to solve this least-squares problem.
منابع مشابه
Superlinearly convergent exact penalty projected structured Hessian updating schemes for constrained nonlinear least squares: asymptotic analysis
We present a structured algorithm for solving constrained nonlinear least squares problems, and establish its local two-step Q-superlinear convergence. The approach is based on an adaptive structured scheme due to Mahdavi-Amiri and Bartels of the exact penalty method of Coleman and Conn for nonlinearly constrained optimization problems. The structured adaptation also makes use of the ideas of N...
متن کاملLinearly-constrained line-search algorithm for adaptive filtering
We develop a linearly-constrained line-search adaptive filtering algorithm by incorporating the linear constraints into the least squares problem and searching the solution (filter weights) along the Kalman gain vector. The proposed algorithm performs close to the constrained recursive least squares (CRLS) algorithm while having a computational complexity comparable to the constrained least mea...
متن کاملORTHOGONAL ZERO INTERPOLANTS AND APPLICATIONS
Orthogonal zero interpolants (OZI) are polynomials which interpolate the “zero-function” at a finite number of pre-assigned nodes and satisfy orthogonality condition. OZI’s can be constructed by the 3-term recurrence relation. These interpolants are found useful in the solution of constrained approximation problems and in the structure of Gauss-type quadrature rules. We present some theoretical...
متن کاملExact and approximate solutions of fuzzy LR linear systems: New algorithms using a least squares model and the ABS approach
We present a methodology for characterization and an approach for computing the solutions of fuzzy linear systems with LR fuzzy variables. As solutions, notions of exact and approximate solutions are considered. We transform the fuzzy linear system into a corresponding linear crisp system and a constrained least squares problem. If the corresponding crisp system is incompatible, then the fuzzy ...
متن کاملAnalysis of a linearly constrained least squares algorithm for adaptive beamforming
DTrj QUXIAJAT flSCFTED 3 The problem of linearly constrained least squares has many applications in signal processing. In this paper, we present a perturbation analysis of a linearly constrrined least squares algorithm for adaptive beaniforming. The perturbation bounds for the solution as well as for the alaest residual element are derived. We also propose an error estimation scheme for the res...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013